Quasi-Cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm
نویسندگان
چکیده
This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must be at a specified distance from each other to obtain a given girth. The search for rows satisfying the distance is done sequentially or randomly. Using the proposed algorithm regular and irregular column-weight-two codes are obtained over a wide range of girths, rates, and lengths. The algorithm, which has a complexity linear with respect to the number of rows, provides an easy and fast way to construct quasi-cyclic LDPC codes. Constructed codes show good bit-error rate performance with randomly shifted codes performing better than sequentially shifted ones.
منابع مشابه
A Graphical Model and Search Algorithm Based Quasi-Cyclic Low-Density Parity-Check Codes Scheme
A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC Codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column ...
متن کاملNewly Designed Quasi-Cyclic Low Density Parity Check Codes
This paper presents the construction of large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight which has cut down hardware implementation cost and complexity as compared to the connection of individual columns and rows. The construction of newly obtained codes gives a class of efficiently encodable quasi-cyclic LDPC codes.
متن کاملMethods of Searching for Trapping Sets of Quasi-cyclic Ldpc Codes and Their Applications in Code Construction
We present a methodology to search for harmful subgraphs in the Tanner graph of a regular column-weightthree low-density parity-check (LDPC) code. These harmful subgraphs, which are more commonly known under the name “trapping sets,” cause a degradation in the error correcting performance of LDPC codes in the high signal-to-noise ratio (SNR) region. Our method of searching for trapping sets uti...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007